Permuting machines and priority queuesALDRED, R. E. L; ATKINSON, M. D; VAN DITMARSCH, H. P et al.Theoretical computer science. 2005, Vol 349, Num 3, pp 309-317, issn 0304-3975, 9 p.Article

On Sorting, Heaps, and Minimum Spanning TreesNAVARRO, Gonzalo; PAREDES, Rodrigo.Algorithmica. 2010, Vol 57, Num 4, pp 585-620, issn 0178-4617, 36 p.Article

Analysis of asymmetric single-buffer polling and priority systems without switchover timesTAKINE, T; TAKAGI, H; TAKAHASHI, Y et al.Performance evaluation. 1990, Vol 11, Num 4, pp 253-264, issn 0166-5316, 12 p.Article

Range-restricted mergeable priority queuesBRIGHT, J. D.Information processing letters. 1993, Vol 47, Num 3, pp 159-164, issn 0020-0190Article

A two priority queue with crossover feedbackJEWKES, E. M; STANFORD, D. A.Queueing systems. 2003, Vol 43, Num 1-2, pp 129-146, issn 0257-0130, 18 p.Article

A Dual-Bound Algorithm for Very Fast and Exact Template MatchingSCHWEITZER, Haim; RUI DENG; FINIS ANDERSON, Robert et al.IEEE transactions on pattern analysis and machine intelligence. 2011, Vol 33, Num 3, pp 459-470, issn 0162-8828, 12 p.Article

Heavy traffic response times for a priority queue with linear prioritiesNELSON, R. D.Operations research. 1990, Vol 38, Num 3, pp 560-563, issn 0030-364X, 4 p.Article

Priority queueing involving orientation and the problems of their software implementationMISHKOY, G. K.Computers & mathematics with applications (1987). 1990, Vol 19, Num 1, pp 109-113, issn 0898-1221, 5 p.Article

Delay analysis of discrete-time priority queue with structured inputsTAKAHASHI, Y; HASHIDA, O.Queueing systems. 1991, Vol 8, Num 2, pp 149-163, issn 0257-0130Article

A Complexity O(1) priority queue for event driven molecular dynamics simulationsPAUL, Gerald.Journal of computational physics (Print). 2007, Vol 221, Num 2, pp 615-625, issn 0021-9991, 11 p.Article

Reflected min-max heapsMAKRIS, Christos; TSAKALIDIS, Athanasios; TSICHLAS, Kostas et al.Information processing letters. 2003, Vol 86, Num 4, pp 209-214, issn 0020-0190, 6 p.Article

Analysis of a nonoreemptive priority queue with SPP arrivals of high classSUGAHARA, A; TAKINE, T; TAKAHASHI, Y et al.Performance evaluation. 1995, Vol 21, Num 3, pp 215-238, issn 0166-5316Article

Strong approximations for priority queues; head-of-the-line-first disciplineHAN-QIN ZHANG; GUANG-HUI HSU.Queueing systems. 1992, Vol 10, Num 3, pp 213-234, issn 0257-0130Article

An N server cutoff priority queue where arriving customers request a random number of serversSCHAACK, C; LARSON, R. C.Management science. 1989, Vol 36, Num 5, pp 614-634, issn 0025-1909, 21 p.Article

O(N) implementation of the fast marching algorithmYATZIV, Liron; BARTESAGHI, Alberto; SAPIRO, Guillermo et al.Journal of computational physics (Print). 2006, Vol 212, Num 2, pp 393-399, issn 0021-9991, 7 p.Article

The preempt-resume M/G/1 queue with feedback and clocked schedulesKEILSON, J; SERVI, L. D.Performance evaluation. 1989, Vol 9, Num 3, pp 191-208, issn 0166-5316, 18 p.Article

Kinetic hangerDA FONSECA, Guilherme D; DE FIGUEIREDO, Celina M. H; CARVALHO, Paulo C. P et al.Information processing letters. 2004, Vol 89, Num 3, pp 151-157, issn 0020-0190, 7 p.Article

A performance comparison of event calendar algorithms: an empirical approachKEHSIUNG CHUNG; JANCHE SANG; VERNON REGO et al.Software, practice & experience. 1993, Vol 23, Num 10, pp 1107-1138, issn 0038-0644Article

The distributional form of Little's law and the Fuhrmann-Cooper decompositionKEILSON, J; SERVI, L. D.Operations research letters. 1990, Vol 9, Num 4, pp 239-247, issn 0167-6377, 9 p.Article

A note on the construction of the data structure «deap»CARLSSON, S; JINGSEN CHEN; STROTHOTTE, T et al.Information processing letters. 1989, Vol 31, Num 6, pp 315-317, issn 0020-0190Article

First in Line Waiting Times as a Tool for Analysing Queueing SystemsKOOLE, G. M; NIELSEN, B. F; NIELSEN, T. B et al.Operations research. 2012, Vol 60, Num 5, pp 1258-1266, issn 0030-364X, 9 p.Article

Equivalence between Priority Queues and SortingTHORUP, Mikkel.Journal of the Association for Computing Machinery. 2007, Vol 54, Num 6, issn 0004-5411, 28-28:27Article

Etude et mise en œuvre de structures de données pour la recherche d'arbres dans les graphes valués = Study and implementation of data-structures for finding trees in weighted graphsROTTEMBOURG, Benoît; MINOUX, Michel.1993, 250 p.Thesis

Workload in queues having priorities assigned according to service timeKIESSLER, P. C; WORTMAN, M. A.Queueing systems. 1992, Vol 10, Num 4, pp 403-408, issn 0257-0130Article

A single server priority queue with server failures and queue flushingTOWSLEY, D; TRIPATHI, S. K.Operations research letters. 1991, Vol 10, Num 6, pp 353-362, issn 0167-6377Article